a bi-objective model for a flowshop scheduling problem with availability constraint of machines

نویسندگان

محمّد رضائی ملک

دانشجوی دکتری مهندسی صنایع پردیس دانشکده‏های فنی دانشگاه تهران رضا توکلی مقدم

استاد دانشکدة مهندسی صنایع پردیس دانشکده‏های فنی دانشگاه تهران فرشید عوض آبادیان

کارشناس ارشد مهندسی صنایع پردیس دانشکده‏های فنی دانشگاه تهران

چکیده

this paper presents a new bi-objective mathematical model for a permutation flowshop scheduling problem with availability constraint in case of preventive maintenance operations on machines. in this paper, preventive maintenance is flexible and there is not a certain time for the maintenance operation; however, time between two consecutive maintenance operations for each machine should not be greater than a given time. the model has two objectives; (1) minimizing the makespan (i.e., cmax) and, (2) minimizing the sum of earliness and tardiness simultaneously. this study reports the results obtained by the reservation level tchebycheff procedure (rltp) and the ε-constraint method for solving a case study problem. the results show high quality of reached solutions from rltp in comparison with the ε-constraint method.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics

This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...

متن کامل

A Multi-objective Immune System for a New Bi-objective Permutation Flowshop Problem with Sequence-dependent Setup Times

 We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is ...

متن کامل

A multi-objective mathematical model for nurse scheduling problem with hybrid DEA and augmented ε-constraint method: A case study

The efficient management of nursing personnel is of vital importance in a hospital’s environment comprising a vast share of the hospital’s operational costs. In the nurse scheduling problem (NSP), the target is to allocate shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. This paper presents a multi-objective...

متن کامل

A HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...

متن کامل

A multi-objective mathematical model for production-distribution scheduling problem

With increasing competition in the business world and the emergence and development of new technologies, many companies have turned to integrated production and distribution for timely production and delivery at the lowest cost of production and distribution and with the least delay in delivery. By increasing human population and the increase in greenhouse gas emissions and industrial waste, in...

متن کامل

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023